Classifying Co-Resident Computer Programs Using Information Revealed by Resource Contention
نویسندگان
چکیده
منابع مشابه
Resource Contention in Multiagent Systems
The dynamics of resource contention in multiagent systems with imperfect information can be extremely complex, ranging from nonlinear oscillations to chaotic behavior. It was shown by Hogg and Huberman that it is possible to stabilize such systems by allowing agents to follow different strategies. We now show that there is a wide range of possible strategies consistent with the existing equilib...
متن کاملClassifying with Co-stems - A New Representation for Information Filtering
Besides the content the writing style is an important discriminator in information filtering tasks. Ideally, the solution of a filtering task employs a text representation that models both kinds of characteristics. In this respect word stems are clearly content capturing, whereas word suffixes qualify as writing style indicators. Though the latter feature type is used for part of speech tagging...
متن کاملClassifying qualitative information using centroid based methods
In this paper we consider the problem of classification of qualitative data. We present an approach to overcome several difficulties which show SAHN (sequential, agglomerative, hierarchic, nonoverlapping) clustering methods to classify qualitative data when using centroids to compute similarities between pairs of classes. The approach is based on a recently proposed class of qualitative weighte...
متن کاملGenetic Evolution and Co-evolution of Computer Programs
Research in the field of artificial life focuses on computer programs that exhibit some of the properties of biological life (e.g. self-reproducibility, evolutionary adaptation to an environment, etc.). In one area of artificial life research, human programmers write intentionally simple computer programs (often incorporating observed features of actual biological processes) and then study the ...
متن کاملResource Contention Metrics for Oversubscribed Scheduling Problems
We investigate a task insertion heuristic for oversubscribed scheduling problems, max-availability, that uses a simple estimate of resource contention to assign tasks to intervals expected to have the best worst case resource availability. Prior research in value and variable ordering heuristics for scheduling problems indicated that sophisticated, but more costly measures of resource contentio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Digital Threats: Research and Practice
سال: 2021
ISSN: 2692-1626,2576-5337
DOI: 10.1145/3464306